منابع مشابه
A Constant Update Time Finger Search Tree
Levcopolous and Overmars [L088] described a search tree in which the time to insert or delete a key was O( 1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Ko...
متن کاملA Simple Balanced Search Tree with O(1) Worst-Case Update Time
In this paper we show how a slight modification of (a, 2b)-trees allows us to perform member and neighbor queries in O(logn) time and updates in O(1) worst-case time (once the position of the inserted or deleted key is known). Our data structure is quite natural and much simpler than previous worst-case optimal solutions. It is based on two techniques : 1) bucketing, i.e., storing an ordered li...
متن کاملA Simple Balanced Search Tree with O(1) Worst-case Update Time 1
In this paper we show how a slight modiication of (a; b)-trees allows us to perform member and neighbor queries in O(log n) time and updates in O(1) worst-case time (once the position of the inserted or deleted key is known). Our data structure is quite natural and much simpler than previous worst-case optimal solutions. It is based on two techniques : 1) bucketing, i.e. storing an ordered list...
متن کاملA Simple Balanced Search Tree With O Worst Case Update Time
In this paper we show how a slight modi cation of a b trees allows us to perform member and neighbor queries in O log n time and updates in O worst case time once the position of the inserted or deleted key is known Our data structure is quite natural and much simpler than previous worst case optimal solutions It is based on two techniques bucketing i e storing an ordered list of log n keys in ...
متن کاملValue-Update Rules for Real-Time Search
Real-time search methods have successfully been used to solve a large variety of search problems but their properties are largely unknown. In this paper, we study how existing real-time search methods scale up. We compare two realtime search methods that have been used successfully in the literature and differ only in the update rules of their values: Node Counting, a real-time search method th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1994
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00115-4